New Algebraic Decoding of (17,9,5) Quadratic Residue Code by using Inverse Free Berlekamp-Massey Algorithm (IFBM)
نویسنده
چکیده
In this paper a new algebraic decoding approach for (17,9,5) Quadratic Residue Code is proposed by using the Inverse Free Berlekamp-MasseyAlgorithm i.e. IFBM algorithm. By using an efficient algorithm an unknown syndrome are also developed in this paper. With the help of unknown syndromes, we achieve the alternative consecutive syndromes which are needed for the application of the Berlekamp-Massey algorithm. The decoding scheme developed here, is simpler to put into effect than the previous decoding algorithm developed for (17,9,5) QR code. AMS subject classification: 94A60.
منابع مشابه
Analysis on the Algebraic Decoding of the (31, 16, 7) QR Code by Using IFBM Algorithm
An analysis on the algebraic decoding of the (31, 16, 7) quadratic residue (QR) code with reducib le generator polynomial that uses the inverse-free Berlekamp-Massey (IFBM) algorithm to determine the error-locator polynomial is presented in this paper. The primary known syndrome S1 will be equal to zero for some weight-3 error patterns. However, the zero S1 does not cause a decoding failure whi...
متن کاملA Viewpoint on the Decoding of the Quadratic Residue Code of Length 89
A viewpoint on the weight-6 error patterns of the algebraic decoding of the (89, 45, 17) quadratic residue (QR) code with reducible generator polynomial, proposed by Truong et al. (2008), is presented in this paper. Some weight-6 error patterns will cause a zero value in the syndrome S1. However, in this case, the inverse-free Berlekamp-Massey (IFBM) algorithm is still valid to determine the er...
متن کاملAlgebraic Decoding of Quadratic Residue Codes Using Berlekamp-Massey Algorithm
In this paper, an algebraic decoding method is proposed for the quadratic residue codes that utilize the Berlekamp-Massey algorithm. By a modification of the technique developed by He et al., one can express the unknown syndromes as functions of the known syndromes. The unknown syndromes are determined by an efficient algorithm also developed in this paper. With the appearance of unknown syndro...
متن کاملDecoding Binary Quadratic Residue codes Using the Euclidean Algorithm
A simplified algorithm for decoding binary quadratic residue (QR) codes is developed in this paper. The key idea is to use the efficient Euclidean algorithm to determine the greatest common divisor of two specific polynomials which can be shown to be the error-locator polynomial. This proposed technique differs from the previous schemes developed for QR codes. It is especially simple due to the...
متن کاملA partial-inverse approach to decoding Reed-Solomon codes and polynomial remainder codes
The thesis develops a new approach to the central themes of algebraic coding theory. The focus here is the newly introduced concept of a partial-inverse polynomial in a quotient ring F [x]/m(x). In particular, the decoding of Reed-Solomon codes can be attributed to the computation of a partial-inverse polynomial. The problem of practical computation of a partial-inverse polynomial is closely re...
متن کامل